1 A Tool Box for Compiler Construction
نویسندگان
چکیده
This paper presents a set of tools supporting the construction of nearly every compiler phase. Design goals of this tool box have been practical usability, significantly reduced effort for compiler construction, and high quality of the generated compilers. Especially efficiency should be competitive to hand crafting. Currently modules in the target languages C and Modula-2 can be generated. First realistic applications demonstrate the excellent performance of the tools and show that the tools allow the construction of production quality compilers.
منابع مشابه
An educational tool for teaching compiler construction
Compiler construction is a well-developed discipline since there is a long tradition of producing compilers supported by practical underlying theory and a large selection of textbooks. In the compiler construction course, students learn how to write a compiler by hand and how to generate a compiler using tools like lex and yacc. However, these tools usually have little or no didactical value. I...
متن کاملDemonstration Abstract: BNF Converter
We will demonstrate BNFC (the BNF Converter) [7, 6], a multi-lingual compiler tool. BNFC takes as its input a grammar written in LBNF (Labelled BNF) notation, and generates a compiler front-end (an abstract syntax, a lexer, and a parser). Furthermore, it generates a case skeleton usable as the starting point of back-end construction, a pretty printer, a test bench, and a LTEX document usable as...
متن کاملBlack-Box Equivalence Checking Across Compiler Optimizations
Equivalence checking is an important building block for program synthesis and verification. For a synthesis tool to compete with modern compilers, its equivalence checker should be able to verify the transformations produced by these compilers. We find that the transformations produced by compilers are much varied and the presence of undefined behaviour allows them to produce even more aggressi...
متن کاملInteractive Compilation and Performance Analysis with URSA MINOR
This paper proposes solutions to two important problems with parallel programming environments that were not previously addressed. The rst issue is that current compilers are typically black-box tools with which the user has little interaction. Information gathered by the compiler, although potentially very meaningful for the user, is often inaccessible or hard to decipher. Second, compilation ...
متن کاملOn the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
We study the complexity of black-box constructions of linearstretch pseudorandom generators starting from a 1-bit stretch oracle generator G. We show that there is no construction which makes nonadaptive queries to G and then just outputs bits of the answers. The result extends to constructions that both work in the non-uniform setting and are only black-box in the primitive G (not the proof of...
متن کامل